BINDING NUMBER AND MINIMUM DEGREE FOR FRACTIONAL (k,m)-DELETED GRAPHS
نویسندگان
چکیده
منابع مشابه
Chromatic number and minimum degree of Kr+1-free graphs
Let (G) be the minimum degree of a graph G: A number of results about trianglefree graphs determine the maximum chromatic number of graphs of order n with (G) n=3: In this paper these results are extended to Kr+1-free graphs of order n with (G) (1 2= (2r 1))n: In particular: (a) there exist Kr+1-free graphs of order n with (G) > (1 2= (2r 1))n o (n) and arbitrary large chromatic number; (b) if ...
متن کاملMinimum degree games for graphs
Given δ and n, a minimum degree game starts with n disconnected nodes. Two players alternate, each adding a new edge in turn, until the resulting graph has minimum degree at least δ. In the achievement game, the last player to move is the winner; in the avoidance game, the last to play is the loser. We determine a winning strategy for the avoidance game for every δ and n. The achievement game i...
متن کاملOn Independent Domination Number of Graphs with given Minimum Degree
We prove a new upper bound on the independent domination number of graphs in terms of the number of vertices and the minimum degree. This bound is slightly better than that by J. Haviland 3] and settles Case = 2 of the corresponding conjecture by O. Favaron 2].
متن کاملThe Total Chromatic Number of Graphs of High Minimum Degree
If G is a simple graph with minimum degree <5(G) satisfying <5(G) ^ f(| K(C?)| -f-1) the total chromatic number conjecture holds; moreover if S(G) ^ f| V(G)\ then #T(G) < A(G) + 3. Also if G has odd order and is regular with d{G) ^ \^/1\V{G)\ then a necessary and sufficient condition for ^T((7) = A((7)+ 1 is given.
متن کاملDiameter Two Graphs of Minimum Order with Given Degree Set
The degree set of a graph is the set of its degrees. Kapoor et al. [Degree sets for graphs, Fund. Math. 95 (1977) 189-194] proved that for every set of positive integers, there exists a graph of diameter at most two and radius one with that degree set. Furthermore, the minimum order of such a graph is determined. A graph is 2-self- centered if its radius and diameter are two. In this paper for ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bulletin of the Australian Mathematical Society
سال: 2011
ISSN: 0004-9727,1755-1633
DOI: 10.1017/s0004972711002784